Generation of Rule-Based Constraint Solvers: Combined Approach
نویسندگان
چکیده
Inductive Constraint Solving is a subfield of inductive machine learning concerned with the automatic generation of rule-based constraint solvers. In this paper, we propose an approach to generate constraint solvers given the definition of the constraints that combines the advantages of generation by construction with generation by testing. In our proposed approach, semantically valid rules are constructed symbolically, then the constructed rules are used to prune the search tree of a generate and test method. The combined approach leads in general to more expressive and efficient constraint solvers. The generated rules are implemented in the language Constraint Handling Rules.
منابع مشابه
Deductive Generation of Constraint Propagation Rules
Constraint propagation can often be conveniently expressed by rules. In recent years, a number of techniques for automatic generation of rule-based constraint solvers have been developed, most of them using a generate-and-test approach. We examine a generation method that is based on deduction. A solver (i. e., a set of rules) for a complex constraint is obtained from one or several weaker solv...
متن کاملSMT Solvers for Validation of B and Event-B Models
We present an integration of the constraint solving kernel of the ProB model checker with the SMT solver Z3. We apply the combined solver to B and Event-B predicates, featuring higher-order datatypes and constructs like set comprehensions. To do so we rely on the finite set logic of Z3 and provide a new translation from B to Z3, better suited for constraint solving. Predicates can then be solve...
متن کاملARM: Automatic Rule Miner
Rule-based formalisms are ubiquitous in computer science. However, a difficulty that arises frequently when specifying or programming the rules is to determine which effects should be propagated by these rules. In this paper, we present a tool called ARM (Automatic Rule Miner) that generates rules for relations over finite domains. ARM offers a rich functionality to provide the user with the po...
متن کاملAutomatic generation of CHR constraint solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work (Apt and Monfroy 1999; Ringeissen and Monfroy 2000; Abdennadher and Rigotti 2000; Abdennadher and ...
متن کاملIntegration and Optimization of Rule-Based Constraint Solvers
One lesson learned from practical constraint solving applications is that constraints are often heterogeneous. Solving such constraints requires a collaboration of constraint solvers. In this paper, we introduce a methodology for the tight integration of CHR constraint programs into one such program. CHR is a high-level rule-based language for writing constraint solvers and reasoning systems. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007